Lowness for The Class of Random Sets
نویسندگان
چکیده
A positive answer to a question of M. van Lambalgen and D. Zam-bella whether there exist nonrecursive sets that are low for the class of random sets is obtained. Here a set A is low for the class RAND of random sets if RAND = RAND A .
منابع مشابه
Benign cost functions and lowness properties
We show that the class of strongly jump-traceable c.e. sets can be characterised as those which have sufficiently slow enumerations so they obey a class of well-behaved cost function, called benign. This characterisation implies the containment of the class of strongly jump-traceable c.e. Turing degrees in a number of lowness classes, in particular the classes of the degrees which lie below inc...
متن کاملLowness for Difference Tests
We show that being low for difference tests is the same as being computable and therefore lowness for difference tests is not the same as lowness for difference randomness. This is the first known example of a randomness notion where lowness for the randomness notion and lowness for the test notion do not coincide. Additionally, we show that for every incomputable set A, there is a difference t...
متن کاملLowness for Bounded Randomness Rod Downey and Keng
In [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore the lowness notions associated with these randomness notions. While these bounded notions seem far from classical notions with infinite tests like Martin-Löf and Demuth randomness, the lowness notions associated with bounded randomness turn out...
متن کاملOn Boolean Lowness and Boolean Highness
The concepts of lowness and highness originate from recursion theory and were introduced into the complexity theory by Sch. oning (Lecture Notes in Computer Science, Vol. 211, Springer, Berlin, 1985). Informally, a set is low (high resp.) for a relativizable class K of languages if it does not add (adds maximal resp.) power to K when used as an oracle. In this paper, we introduce the notions of...
متن کاملω-Change Randomness and Weak Demuth Randomness
We extend our work on difference randomness. Each component of a difference test is a Boolean combination of two r.e. open sets; here we consider tests in which the k component is a Boolean combination of g(k) r.e. open sets for a given recursive function g. We use this method to produce an alternate characterization of weak Demuth randomness in terms of these tests and further show that a real...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 64 شماره
صفحات -
تاریخ انتشار 1999